package com.study.leetcode;

public class Solution_136 {
    public int singleNumber(int[] nums) {
        int temp = 0;
        for (int num : nums) {
            temp = temp ^ num;
        }
        return temp;
    }
}
